Generalized quantifiers and pebble games on finite structures
نویسندگان
چکیده
منابع مشابه
Pebble Games and Linear Equations
We give a new, simplified and detailed account of the correspondence between levels of the Sherali–Adams relaxation of graph isomorphism and levels of pebble-game equivalence with counting (higher-dimensional Weisfeiler–Lehman colour refinement). The correspondence between basic colour refinement and fractional isomorphism, due to Tinhofer [22, 23] and Ramana, Scheinerman and Ullman [17], is re...
متن کاملInterpolation, Preservation, and Pebble Games
Preservation and interpolation results are obtained for L1! and sublog-ics L L1! such that equivalence in L can be characterized by suitable back-and-forth conditions on sets of partial isomorphisms.
متن کاملProbabilistic Quantifiers and Games
We consider inclusion relations among a multitude of classical complexity classes and classes with probabilistic components. A key tool is a method for characterizing such classes in terms of the ordinary quantifiers 3 and V together with a quantifier 3+, which means roughly “for most,” applied to polynomial-time predicates. This approach yields a uniform treatment which leads to easier proofs ...
متن کاملGeneralized Implicit Definitions on Finite Structures
We propose a natural generalization of the concept of implicit deenitions over nite structures, allowing non-determinism at an intermediate level of a (deterministic) deenition. These generalized implicit deenitions ooer more expressive power than classical implicit dee-nitions. Moreover, their expressive power can be characterized over un-ordered nite structures in terms of the complexity clas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1995
ISSN: 0168-0072
DOI: 10.1016/0168-0072(94)00025-x